package leetcode.剑指offer.前40;

import org.junit.Test;

/**
 * @author :songyaozhang
 * @date :Created 2021/7/22 16:52
 * @description :https://leetcode-cn.com/problems/ju-zhen-zhong-de-lu-jing-lcof/
 */
public class 剑指_12_矩阵中的路径 {
    @Test
    public void test() {
        Solution solution = new Solution();

    }

    class Solution {
        int[][] dirs = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
        public boolean exist(char[][] board, String word) {
            int rows = board.length;
            if (rows == 0 || board[0].length == 0) return false;
            int cols = board[0].length;
            boolean[][] isUsed = new boolean[rows][cols];
            //return exit0(isUsed, 0, 0, 0);
            return true;
        }
    }
}
